Phase Transitions in Spectral Community Detection
نویسندگان
چکیده
منابع مشابه
Phase Transitions in Community Detection: A Solvable Toy Model
Recently, it was shown that there is a phase transition in the community detection problem. This transition was first computed using the cavity method, and has been proved rigorously in the case of q = 2 groups. However, analytic calculations using the cavity method are challenging since they require us to understand probability distributions of messages. We study analogous transitions in so-ca...
متن کاملComputational Complexity, Phase Transitions, and Message-Passing for Community Detection
These are notes from the lecture of Cristopher Moore given at the autumn school “Statistical Physics, Optimization, Inference, and Message-Passing Algorithms”, that took place in Les Houches, France from Monday September 30th, 2013, till Friday October 11th, 2013. The school was organized by Florent Krzakala from UPMC & ENS Paris, Federico Ricci-Tersenghi from La Sapienza Roma, Lenka Zdeborová ...
متن کاملNUMERICAL SIMULATIONS OF THE PHASE TRANSITIONS IN CLUSTERS
We have studied the phase transitions in atomic clusters by molecular dynamics simulation, assuming Lennard-Jones interatomic pair potential. Calculations are performed by DAP parallel computer. The results are analyzed by simulating their orientational distribution plots (dot-plot), and neutron diffraction patterns. It is shown that all the main features of the bulk phase transitions are e...
متن کاملSpectral community detection in sparse networks
Spectral methods based on the eigenvectors of matrices are widely used in the analysis of network data, particularly for community detection and graph partitioning. Standard methods based on the adjacency matrix and related matrices, however, break down for very sparse networks, which includes many networks of practical interest. As a solution to this problem it has been recently proposed that ...
متن کاملMultiway spectral community detection in networks
One of the most widely used methods for community detection in networks is the maximization of the quality function known as modularity. Of the many maximization techniques that have been used in this context, some of the most conceptually attractive are the spectral methods, which are based on the eigenvectors of the modularity matrix. Spectral algorithms have, however, been limited, by and la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2015
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2015.2442958